The existence of (v, 4, λ) disjoint difference families

نویسندگان

  • Dianhua Wu
  • Jianxiao Yang
  • Shuming Chen
  • Desheng Li
چکیده

A (v, k, λ) difference family ((v, k, λ)-DF in short) over an abelian group G of order v is a collection F = {Bi | i ∈ I} of k-subsets of G, called base blocks, such that each nonzero element of G can be represented in precisely λ ways as a difference of two elements lying in some base blocks in F . A disjoint (v, k, λ)-DF is a difference family with disjoint blocks. In this paper, it is proved that there exists a (v, 4, 1)-DDF for each prime power v ≡ 1 (mod 12) and v ≥ 13. It is also proved that there exists a (v, 4, 2)-DDF for each prime power v ≡ 1 (mod 6) and v ≥ 7. ∗ Research supported in part by NSFC(Grant No. 10561002), Guangxi Science Foundation (0640062) and Innovation Project of Guangxi Graduate Education. D. Wu is also with Keylab of Information Coding and Transmission, Southwest Jiaotong University, Chengdu, 610031, China. 226 D. WU, J. YANG, S. CHEN AND D. LI

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the existence of balanced (q, {3, 4}, 1) difference families

A (v,K, λ) difference family ((v,K, λ)-DF in short) can be used to construct a (v,K, λ)-PBD. A lot of work has been done on the existence of (v, k, 1) difference families ((v, k, 1)-DF in short) when K = {k} is a singleton. For K = {3, 4}, partial results have been obtained by Buratti. In this paper, it is proved that there exists a balanced (q, {3, 4}, 1)-DF for each prime power q ≡ 1 (mod 18).

متن کامل

New 2-designs from strong difference families

Strong difference families are an interesting class of discrete structures which can be used to derive relative difference families. Relative difference families are closely related to 2-designs, and have applications in constructions for many significant codes, such as optical orthogonal codes and optical orthogonal signature pattern codes. In this paper, with a careful use of cyclotomic condi...

متن کامل

Complete Sets of Disjoint Difference Families and their Applications

Let G be an abelian group. A collection of (G, k, λ) disjoint difference families, {F0,F1, · · · ,Fs−1}, is a complete set of disjoint difference families if ∪0≤i≤s−1∪B∈FiB form a partition of G− {0}. In this paper, several construction methods are provided for complete sets of disjoint difference families. Applications to one-factorizations of complete graphs and to cyclically resolvable cycli...

متن کامل

On the Number of Mutually Disjoint Cyclic Designs

We denote by LS[N ](t, k, v) a large set of t-(v, k, λ) designs of size N , which is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs and N = ( v−t k−t ) /λ. We use the notation N(t, v, k, λ) as the maximum possible number of mutually disjoint cyclic t-(v, k, λ)designs. In this paper we give some new bounds for N(2, 29, 4, 3) and N(2, 31, 4, 2). Consequently we presen...

متن کامل

Existence and non-existence results for strong external difference families

We consider strong external difference families (SEDFs); these are external difference families satisfying additional conditions on the patterns of external differences that occur, and were first defined in the context of classifying optimal strong algebraic manipulation detection codes. We establish new necessary conditions for the existence of (n,m, k, λ)-SEDFs; in particular giving a near-co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2009